bounds for the co-pi index of a graph
Authors
abstract
in this paper, we present some inequalities for the co-pi index involving the some topological indices, the number of vertices and edges, and the maximum degree. after that, we give a result for trees. in addition, we give some inequalities for the largest eigenvalue of the co-pi matrix of g.
similar resources
Bounds for the Co-PI index of a graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
full textBounds for the Co - PI Index of a Graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
full textBounds on First Reformulated Zagreb Index of Graph
The first reformulated Zagreb index $EM_1(G)$ of a simple graph $G$ is defined as the sum of the terms $(d_u+d_v-2)^2$ over all edges $uv$ of $G .$ In this paper, the various upper and lower bounds for the first reformulated Zagreb index of a connected graph interms of other topological indices are obtained.
full textBounds for index of a modified graph
If a graph is connected then the largest eigenvalue (i.e., index) generally changes (decreases or increases) if some local modifications are performed. In this paper two types of modifications are considered: (i) for a fixed vertex, t edges incident with it are deleted, while s new edges incident with it are inserted; (ii) for two non-adjacent vertices, t edges incident with one vertex are dele...
full textComputation of Co-PI Index of TUC4C8(R) Nanotubes
In this paper, at first we introduce a new index with the name Co-PI index and obtain some properties related this new index. Then we compute this new index for TUC4C8(R) nanotubes.
full textBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
full textMy Resources
Save resource for easier access later
Journal title:
iranian journal of mathematical chemistryPublisher: university of kashan
ISSN 2228-6489
volume 6
issue 1 2015
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023